Constraint reasoning and planning in concurrent design
نویسندگان
چکیده
By concurrent design we mean* in pan, concurrent consideration of a broad range of life-cycle constraints concerning, for example manufacturing and maintenance. The multitude of constraints arising from these considerations make it difficult to identify satisfactory designs. An alternative to explicitly considering all constraints is to determine which of the constraints are relevant, redundant or inconsistent and to consider only those which impact design decisions. The proposed approach is based on two simple ideas: (1) Constraints provide a unifonn representation for a variety of life-cycle concerns, and (2) Interval methods applied to constraints can be used to identify critical constraints, eliminate redundant constraints and to narrow the space of design alternatives. The application of the necessary and sufficient intervals of constraints and constraint propagation techniques are used to classify constraints in this way and to focus design activity. Regional monotinicity properties are used to identify critical constraints. A related aspect of concurrent design problems is the large number of complex constraints which have to be satisfied to complete a design task. As it is impossible to guarantee the simultaneous solution of a large set of design constraints, we have investigated algorithms for planning and simplifying such constraint problems. Chapter
منابع مشابه
Representing Flexible Temporal Behaviors in the Situation Calculus
In this paper we present an approach to representing and managing temporally-flexible behaviors in the Situation Calculus based on a model of time and concurrent situations. We define a new hybrid framework combining temporal constraint reasoning and reasoning about actions. We show that the Constraint Based Interval Planning approach can be imported into the Situation Calculus by defining a te...
متن کاملDISTRIBUTED CONSTRAINT OPTIMIZATION FOR MULTIAGENT SYSTEMS by Pragnesh
To coordinate effectively, multiple agents must reason and communicate about the interactions between their individual local decisions. Distributed planning, distributed scheduling, distributed resource allocation and distributed task allocation are some examples of multiagent problems where such reasoning is required. In order to represent these types of automated reasoning problems, researche...
متن کاملTemporal reasoning in process planning* MIRA BALABAN and DAN BRAHA
Computer-aided process planning has been recognized as an important tool for coordinating the different operations involved in making the product. While temporal knowledge is central to the design of efficient and reliable process plans, little attention is given to the integration of process planning and temporal processing and reasoning. To fill the void, we propose in this paper a practical ...
متن کاملTemporal Reasoning for Planning and Scheduling in Complex Domains: Lessons Learned
Over the past five years, we have implemented and applied efficient, general-purpose temporal reasoning as a substrate for building planning and scheduling systems. We have also investigated the kinds of temporal reasoning that will be most useful, and for what problems. Our results confirm that temporal reasoning is a sufficiently self-contained activity to be implemented entirely independentl...
متن کاملA Two-Stage Chance-Constraint Stochastic Programming Model for Electricity Supply Chain Network Design
Development of every society is incumbent upon energy sector’s technological and economic effectiveness. The electricity industry is a growing and needs to have a better performance to effectively cover the demand. The industry requires a balance between cost and efficiency through careful design and planning. In this paper, a two-stage stochastic programming model is presented for the design o...
متن کامل